Bounds for Multilinear Sublevel Sets
نویسنده
چکیده
The question in the form (1.2) was posed by Li, Tao, Thiele, and this author in [5]. Nonoscillatory inequalities of the form ∫ ∏ j |fj◦`j | . ∏ j ‖fj‖Lpj have been studied in [1],[2]. Oscillatory integral inequalities of this type have been extensively studied for n = 2, where one is dealing with bilinear forms 〈Tλ(f1), f2〉. The associated linear operators Tλ are commonly known as oscillatory integrals of the second type, and a simple necessary and sufficient condition for (1.2) to hold (with some unspecified exponent) is known [7]. There is an extensive literature dealing with more specific inequalities involving Lp norms, in which one seeks the optimal exponent δ as a function of exponents p. For n ≥ 3, however, there arises a class of singular oscillatory integrals which have no direct analogues in the bilinear case. These singular cases arise when d < ∑ j dj . Generic ordered n-tuples of points (x1, · · · , xn) ∈
منابع مشابه
On Multilinear Oscillatory Integrals, Nonsingular and Singular
Basic questions concerning nonsingular multilinear operators with oscillatory factors are posed and partially answered. L norm inequalities are established for multilinear integral operators of Calderón-Zygmund type which incorporate oscillatory factors e iP , where P is a real-valued polynomial. A related problem concerning upper bounds for measures of sublevel sets is solved.
متن کاملSome Lower Bound Results for Set-Multilinear Arithmetic Computations
In this paper, we study the structure of set-multilinear arithmetic circuits and set-multilinear branching programs with the aim of showing lower bound results. We define some natural restrictions of these models for which we are able to show lower bound results. Some of our results extend existing lower bounds, while others are new and raise open questions. Specifically, our main results are t...
متن کاملSome criteria for error bounds in set optimization
We obtain sufficient and/or necessary conditions for global/local error bounds for the distances to some sets appeared in set optimization studied with both the set approach and vector approach (sublevel sets, constraint sets, sets of all Pareto efficient/ Henig proper efficient/super efficient solutions, sets of solutions corresponding to one Pareto efficient/Henig proper efficient/super effic...
متن کاملHitting-Sets for ROABP and Sum of Set-Multilinear Circuits
We give a nO(log n)-time (n is the input size) blackbox polynomial identity testing algorithm for unknown-order read-once oblivious arithmetic branching programs (ROABP). The best time-complexity known for blackbox PIT for this class was nO(log 2 n) due to Forbes-SaptharishiShpilka (STOC 2014). Moreover, their result holds only when the individual degree is small, while we do not need any such ...
متن کاملSolvability for a Class of the System of the Nonlinear Suspension Bridge Equations
We show the existence of the nontrivial periodic solution for a class of the system of the nonlinear suspension bridge equations with Dirichlet boundary condition and periodic condition by critical point theory and linking arguments. We investigate the geometry of the sublevel sets of the corresponding functional of the system, the topology of the sublevel sets and linking construction between ...
متن کامل